An upper bound on the hot spots constant

نویسندگان

چکیده

Let $D \subset \mathbb{R}^d$ be a bounded, connected domain with smooth boundary, and let $-\Delta u = \mu\_1 u$ the first nontrivial eigenfunction of Laplace operator Neumann boundary conditions. We prove that $$ \max\_{x \in D} \~u(x) \leq 60 \cdot \partial we emphasize this constant is uniform among all domains in dimensions. In particular, hot spots conjecture cannot fail by an arbitrarily large factor. The inequality also holds for other (Neumann-) eigenfunctions (possibly different constant) provided their eigenvalue smaller than Dirichlet eigenvalue. An example Kleefeld shows optimal at least $1 + 10^{-3}$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Upper Bound on the First Zagreb Index in Trees

In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.

متن کامل

An Improved Upper Bound on the Growth Constant of Polyominoes

Polyominoes are edge-connected sets of squares on the square lattice. The symbol λ usually denotes the growth constant of A(n), the sequence that enumerates polyominoes. In this paper we prove that λ ≤ 4.5685 by analyzing the growth constant of a sequence B(n), for which B(n) ≥ A(n) for any value of n ∈ N. The recursive formula for B(n) is based on the representation of a polyomino as the assem...

متن کامل

On trees attaining an upper bound on the total domination number

‎A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$‎. ‎The total domination number of a graph $G$‎, ‎denoted by $gamma_t(G)$‎, ‎is~the minimum cardinality of a total dominating set of $G$‎. ‎Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004)‎, ‎6...

متن کامل

an upper bound on the first zagreb index in trees

in this paper we give sharp upper bounds on the zagreb indices and characterize all trees achieving equality in these bounds. also, we give lower bound on first zagreb coindex of trees.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revista Matematica Iberoamericana

سال: 2022

ISSN: ['2235-0616', '0213-2230']

DOI: https://doi.org/10.4171/rmi/1350